Non-averaging Subsets and Non-vanishing Transversals
نویسندگان
چکیده
منابع مشابه
Non-averaging Subsets and Non-vanishing Transversals
It is shown that every set of n integers contains a subset of size Ω(n) in which no element is the average of two or more others. This improves a result of Abbott. It is also proved that for every > 0 and every m > m( ) the following holds. If A1, . . . , Am are m subsets of cardinality at least m each, then there are a1 ∈ A1, . . . , am ∈ Am so that the sum of every nonempty subset of the set ...
متن کاملTransversals in non-discrete groups
The concept of ‘topological right transversal’ is introduced to study right transversals in topological groups. Given any right quasigroup S with a Tychonoff topology T , it is proved that there exists a Hausdorff topological group in which S can be embedded algebraically and topologically as a right transversal of a subgroup (not necessarily closed). It is also proved that if a topological rig...
متن کاملWhich elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولWell-dispersed subsets of non-dominated solutions for MOMILP problem
This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1999
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2926